convex hull
英 [ˈkɒnveks hʌl]
美 [ˈkɑːnveks hʌl]
网络 凸包; 凸壳; 凸包性; 凸形封包; 凸包算法
双语例句
- This is why the convex hull algorithm front of some preparation work!
这个正是凸包算法前面的一些准备工作！ - Convex hull computation is one of the fundamental problems in computational geometry, and is of wide application in many fields.
凸包计算是计算几何研究中的基本问题之一，在许多领域均有应用。 - The difference function between the ACF and the convex hull is obtained, and then the precession period is estimated by searching for the maximum value of the difference function.
首先求出ACF和其凸包的差函数，然后搜索差函数的最大值，从而得到进动周期的估计值。 - Fast Algorithm for Convex Hull Generation Based on Spatial Division of Scattered Point-Set
基于散乱点集空间划分的凸壳体快速生成算法 - A Method of Evaluating Straightness Errors Based on Approximate Convex Hull
基于近似凸壳的直线度误差评定方法 - Isomorphic Researches on Convex Hull and its Special Properties Based on Algebra View
基于代数视角的凸壳及其特性同构化研究 - Study on the Method of Non-linear Classification Base on the Contraction of the Closed Convex Hull
基于闭凸包收缩的非线性分类方法研究 - The machine can also make convex hull on paper which is especially suitable for the heavy duty air filter.
此机可根据客户要求还能在纸上打凸包，特别适合生产特种大空滤。 - An easy approach is to create a convex hull around an object's location at two different times.
一条简单的途径就是在2不同的时间在一个物体的地点附近创造凸壳。 - Abstract An improved image recognition and registration algorithm based on convex hull and affine invariant was presented.
提出了一种新的基于凸壳和仿射不变量的图像识别和配准的方法。 - Research on Directional Relationships of Grouped point object Based on Convex Hull
基于凸壳的点群目标空间方向关系研究 - Give a real-world example in which one of the following computational problems appears: sorting, determining the best order for multiplying matrices, or finding the convex hull.
给出一个真实世界的例子，其中包含着下列的某种计算问题：排序，确定多矩阵相乘的最佳顺序，或都抽出凸壳。 - Automatic Extracting and Locating Checkerboard Corners Method Based On Convex Hull
基于凸包的棋盘格角点自动识别与定位方法 - On acceleration algorithm of convex hull based on planar point set with either uniform or normal distribution
基于平面的均匀分布和正态分布点集的凸包加速算法研究 - The experiment results are used to validate the effectiveness of the scaled convex hull and its simplicity.
实验结果表明，尺度化凸壳方法求解代价敏感问题的有效性，其求解过程也非常简单。 - The hardness of convex hull is higher than that of pit portion on the sculptured leaf surfaces.
植物非光滑叶表形态中凸包处硬度较凹坑处的硬度大； - That is multi-direction extreme value approximate convex hull algorithm, and is called MDEV for short.
提出并实现了平面点集凸壳的一种新的近似算法&多方向极值法。 - The paper is concerned with two aspects: A necessary and sufficient condition for convex hull of a set in E2 being closed;
本论文以凸体为研究对象，主要涉及两个方面的内容：平面凸集的凸包为闭集的充分必要条件； - According to the characteristics of flatness error evaluation, an algorithm based on convex hull theoretics of computational geometric techniques is proposed in this paper.
本文针对平面度误差评定的特点，提出了一种基于计算几何凸包理论的评定方法。 - Dimension Classification Method of Planar Mechanism Based on Convex Hull Division
基于凸包剖分的平面机构尺度分类方法 - Algorithm of Constructing Convex Hull for Plant Leaf Based on Bidirectional Polar Angle
基于双向极角的植物叶凸包生成算法 - Its applied algorithms such as skin color segmentation, convex hull computation, fingertip detection and etc have been investigated and the hardware has been designed.
对系统所采用的肤色分割、凸包计算、指尖检测等算法进行研究，并完成硬件设计。 - The second algorithm is that polygonal concave points and newly created concave points are continuously removed, and a vertex sequence of the convex hull is finally obtained.
第二个算法不断删去多边形的凹点及新产生的凹点，最后得到凸壳顶点序列。 - Auto-adapted algorithm for constructing convex hull of 2D point set utilizing initial inclusion hull
利用初始包容壳求二维点集凸壳的自适应算法 - In this paper, inspired by the idea of class distribution, the new maximal margin method, scaled convex hull method is applied to solve the cost-sensitive learning.
受改变类分布思想的启发，采用最新的最大间隔方法&尺度化凸壳方法来解决代价敏感学习。 - A Quick Algorithm and Programming to Determine Convex Hull for Planar Scattered Point Set in GIS
GIS中散乱点集凸包的快速算法及编程 - In this paper, a new algorithm is presented for determining the convex hull of a planar set.
提出了一个构建平面点集凸壳的新算法。 - The convex hull problems of plane line segment sets.
本文完成了以下三个方面的研究：1.平面线段集的凸壳问题。 - The method based on convex hull and the method based on perimeter solved the problem of calculating morphology complexity.
基于凸包的方法和基于周长的方法解决了形态复杂度的表征问题。 - The geometric primitive includes convex hull, Voronoi diagram, Triangulation problems, Partition problems and Intersection problems.
其中，几何基元包括凸壳和Voronoi图，多边形的三角剖分、划分问题与相交问题。